Multilayer pin assignment for macro cell circuits

نویسندگان

  • Le-Chin Eugene Liu
  • Carl Sechen
چکیده

We present a pin-assignment algorithm based on a new multi-layer chip-level global router. Combining pin assignment and global routing has been an important approach for the pin-assignment problem. But there are many difficulties when combining the two processes. In the past, only specialized global routing methods were used in the combined process. In our pin assignment program, we use an actual global routing algorithm. To meet the requirement of pin assignment while keeping the routing quality, we dynamically adjust the weights in the routing graph during the routing stage. In addition, the multi-layer technology has introduced new challenges for the pin-assignment problem. Our algorithm can also handle the modern technology to provide pin assignment for multi-layer layouts. To our knowledge, no other pin assignment program can handle multi-layer layout. Tests on industrial circuits show that our pin-assignment algorithm is quite effective at reducing the demand for routing resources.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pin assignment with global routing for general cell designs

In this paper, we present an algorithm which combines the pin assignment step and the global routing step in the physical design of VLSI circuits. Our algorithm is based on two key theorems: the channel pin assignment theorem and the block boundary decomposition theorem. These two theorems enable us to deal successfully with the high complexity resulting from combining the pin assignment and gl...

متن کامل

Pin assignment with global routing for VLSI building block layout

In this paper, we will consider global routing and pin assignment in VLSI building block layout, and present an efficient algorithm which integrates global routing, pin assignment, block reshaping and positioning. The general flow of the proposed algorithm is the same as the one proposed in [1] and consists of two main phases. The first phase is to determine not only global routes and coarse pi...

متن کامل

Pin assignment for multi-FPGA systems

Multi-FPGA systems have tremendous potential, providing a high-performance computing substrate for many different applications. One of the keys to achieving this potential is a complete, automatic mapping solution that creates high-quality mappings in the shortest possible time. In this paper we consider one step in this process, the assignment of inter-FPGA signals to specific I/O pins on the ...

متن کامل

BEAR FP A Robust Framework for Floorplanning

This paper presents a hierarchical oorplanning approach for macrocell layouts which is based on the bottom up clustering shape function computation and top down oor plan optimization with integrated global routing and pin assignment This approach provides means for specifying and techniques for satisfying a wide range of constraints physical topological timing and is therefore able to generate ...

متن کامل

On the problem of gate assignment under different rise and fall delays

In most libraries, gate parameters such as the pin-to-pin intrinsic delays, load-dependent coefficients, and input pin capacitances have different values for rising and falling signals. Most performance optimization algorithms, however, assume a single value for each parameter. It is known that under the load-independent delay model, the gate assignment (or resizing) problem is solvable in time...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. on CAD of Integrated Circuits and Systems

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1999